Adaptation of Parametric Uniform Crossover in Genetic Algorithm

نویسندگان

  • Farhad Nadi
  • Ahamad Tajudin Khader
چکیده

Exploration of the search space occurs at the cost of destructing existing good solutions. This cost will grow as the search progresses. The parametric uniform crossover is a general form of the uniform crossover operator. Using this operator, it would be possible to control the swapping probability of each locus. An adaptive method proposed that control the value of the exchange probability of the parametric uniform crossover. The population will be diversified in case that the population’s diversity decreases. The recombination of the solutions would be done with regards to their fitness distance to reduce the amount of destruction of good solutions. The experiments conducted show significant improvement in the performance of the parametric uniform crossover in comparison with to the state-of-the-art methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Genetic algorithm for Echo cancelling

In this paper, echo cancellation is done using genetic algorithm (GA). The genetic algorithm is implemented by two kinds of crossovers; heuristic and microbial. A new procedure is proposed to estimate the coefficients of adaptive filters used in echo cancellation with combination of the GA with Least-Mean-Square (LMS) method. The results are compared for various values of LMS step size and diff...

متن کامل

Optimization by Decimation: Explaining Adaptation in Genetic Algorithms With Uniform Crossover

We submit the hyperclimbing hypothesis—an explanation for adaptation in genetic algorithms with uniform crossover (UGAs). Hyperclimbing is a stochastic search heuristic that works by decimating a search space, i.e. by iteratively fixing the values of small numbers of search space attributes. Global decimation is known to be an effective way to approach large instances of hard constraint satisfa...

متن کامل

RESOLUTION OF NONLINEAR OPTIMIZATION PROBLEMS SUBJECT TO BIPOLAR MAX-MIN FUZZY RELATION EQUATION CONSTRAINTS USING GENETIC ALGORITHM

This paper studies the nonlinear optimization problems subject to bipolar max-min fuzzy relation equation constraints. The feasible solution set of the problems is non-convex, in a general case. Therefore, conventional nonlinear optimization methods cannot be ideal for resolution of such problems. Hence, a Genetic Algorithm (GA) is proposed to find their optimal solution. This algorithm uses th...

متن کامل

On the Virtues of Parameterized Uniform Crossover

Traditionally, genetic algorithms have relied upon 1 and 2-point crossover operators. Many recent empirical studies, however, have shown the benefits of higher numbers of crossover points. Some of the most intriguing recent work has focused on uniform crossover, which involves on the average L/2 crossover points for strings of length L. Theoretical results suggest that, from the view of hyperpl...

متن کامل

On the Virtues of Parameterised Uniform Crossover

Traditionally, genetic algorithms have relied upon 1 and 2-point crossover operators. Many recent empirical studies, however, have shown the benefits of higher numbers of crossover points. Some of the most intriguing recent work has focused on uniform crossover, which involves on the average L/2 crossover points for strings of length L. Theoretical results suggest that, from the view of hyperpl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013